Reasoning of Geometric Concepts based on Algebraic Constraint-directed Method
نویسندگان
چکیده
We present an algebraic approach to geometric reasoning and learning. The purpose of this research is to avoid the usual difficulties in symbolic handling of geometric concepts. Our system GREW is grounded on a reasoning scheme that integrate the symbolic reasoning and algebraic reasoning of Wu's method. The basic principle of this scheme is to describe mathematical knowledge in terms of symbolic logic and to execute the subsidiary reasoning for Wu's method. The validity of our approach and GREW is shown by experiments, such as applying to learning-by-example of computer vision heuristics or solving locus problems. 1 Introduction This paper presents a new approach for learning or reasoning of geometric concepts based on algebraic constraint-directed methods. Geometric reasoning is available for many applications , such as robotics, CAD and computer vision. However , most previous reasoning systems, which are based on predicate logic, have difficulties in handling geometric notions. This is because the usual symbolic approach fails to grasp the essential characteristics of geometry, and cannot solve complicated problems, such as those which require auxiliary lines. As a result, handling geometric concepts causes great trouble in many applications of reasoning. For instance , consider the heuristics called skewed symmetry in computer vision [Kanade81]. This is a famous geometric constraint which claims that a two-dimensional skewed symmetry is a projected image of a genuine three-dimensional symmetry (Fig.1). Because of transformation-invariant characteristics such as shear transformation, it is very difficult to represent this constraint by usual predicate logic, still more to establish the reasoning system. In order to solve these difficulties , we select Wu's method as algebraic approach, and *I wish to thank members in FAI-WG (Foundation of Artificial Intelligence) and CLP-WG (Constraint Logic Programming) of ICOT for useful comments and discussion on earlier drafts of this work.
منابع مشابه
Encoding Relative Orientation and Mereotopology Relations with Geometric Constraints in CLP(QS)
One approach for encoding the semantics of spatial relations within a declarative programming framework is by systems of polynomial constraints. However, solving such constraints is computationally intractable in general (i.e. the theory of realclosed fields), and thus far the proposed symbolic algebraic methods do not scale to real world problems. In this paper we address this intractability b...
متن کاملGeometric Theorem Proving by Integrated Logical and Algebraic Reasoning
Algebraic geometric reasoning by the Griibner basis method and Wu’s method has been shown to be powerful enough to prove those complex geometric theorems that could not be proved by ordinary logical reasoning methods. These algebraic reasoning methods, however, have a crucial limitation: they cannot correctly handle any geometric concepts involving order relations such as between and congruent ...
متن کاملA Systematic Framework for Solving Geometric Constraints Analytically
A systematic framework is presented for solving algebraic equations arising in geometric constraint solving. The framework has been used successfully to solve a family of spatial geometric constraint problems. The approach combines geometric reasoning, symbolic reduction, and homotopy continuation.
متن کاملAlgebraic Geometry and Group Theory in Geometric Constraint Satisfaction
The determination of a set of geometric entities that satisfy a series of geometric relations (constraints) constitutes the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF) problem. This problem appears in diierent forms in Assembly Planning, Constraint Driven Design, Computer Vision, etc. Its solution is related to the existence of roots to systems of polynomial equations. Previ...
متن کاملSolving Geometric Constraint Systems
Finding the con gurations of a set of rigid bodies that satisfy a set of geometric constraints is a problem traditionally solved by reformulating the geometry and constraints as algebraic equations which are solved symbolically or numerically. But many such problems can be solved by reasoning symbolically about the geometric bodies themselves using a new technique called degrees of freedom anal...
متن کامل